Attack on an Identification Scheme Based on Gap Diffie-Hellman Problem
نویسندگان
چکیده
In [KK], a new identification scheme based on the Gap Diffie-Hellman problem was proposed at SCIS 2002, and it is shown that the scheme is secure against active attacks under the Gap Diffie-Hellman Intractability Assumption. Paradoxically, this identification scheme is totally breakable under passive attacks. In this paper, we show that any adversary holding only public parameters of the scheme can convince a verifier with probability 1.
منابع مشابه
An Improved Identification Scheme
M. Kim and K. Kim [1] introduce a new identification scheme based on the Gap Diffie-Hellman problem, and prove that the scheme is secure against active attacks if the Gap Diffie-Hellman problem is intractable. But, their identification scheme is NOT secure. In this paper, we give the reason that why the scheme is not secure, and we also modify the scheme such that the modified scheme is secure ...
متن کاملA New Identification Scheme based on the Gap Diffie-Hellman Problem
We introduce a new identification scheme based on the Gap Diffie-Hellman problem. Our identification scheme makes use of the fact that the computational Diffie-Hellman problem is hard in the additive group of points of an elliptic curve over a finite field, on the other hand, the decisional Diffie-Hellman problem is easy in the multiplicative group of the finite field mapped by a bilinear map. ...
متن کاملA Zero-Knowledge Identification Scheme in Gap Diffie-Hellman Groups
The Weil [10] and Tate pairings are bilinear maps defined on elliptic curves. They became popular for the design of new schemes since Joux’s tripartite key exchange [8]. When used with specific classes (supersingular and MNT [11]) of curves, they can be computed very efficiently. The existence of pairings gives rise to a new class of problems on these curves, such as the Bilinear Diffie-Hellman...
متن کاملIdentification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
We give a series of three identification schemes. All of them are basically 2-round interactive proofs of ability to complete DiffieHellman tuples. Despite their simple protocols, the second and the third schemes are proven secure against concurrent man-in-the-middle attacks based on tight reduction to the Gap Computational Diffie-Hellman Assumption without the random oracle. In addition, they ...
متن کاملImproved Signcryption from q-Diffie-Hellman Problems
This paper proposes a new public key authenticated encryption (signcryption) scheme based on the hardness of q-Diffie-Hellman problems in Gap Diffie-Hellman groups. This new scheme is quite efficient: the signcryption operation has almost the same cost as an El Gamal encryption while the reverse operation only requires one pairing evaluation and three exponentiations. The scheme’s chosen-cipher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003